Topological Complexity of Basis-conjugating Automorphism Groups
نویسنده
چکیده
We compute the topological complexity of Eilenberg-MacLane spaces associated to the group of automorphisms of a finitely generated free group which act by conjugation on a given basis, and to certain subgroups.
منابع مشابه
Resonance of Basis-conjugating Automorphism Groups
1. Resonance of PΣn Let Fn be the free group generated by x1, . . . , xn. The basis-conjugating automorphism group, or pure symmetric automorphism group, is the group PΣn of all automorphisms of Fn which send each generator xi to a conjugate of itself. Results of Dahm [4] and Goldsmith [6] imply that this group may also be realized as the “group of loops,” the group of motions of a collection o...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملOn Automorphism Groups of Free Products of Finite Groups, I: Proper Actions
If G is a free product of finite groups, let ΣAut1(G) denote all (necessarily symmetric) automorphisms of G that do not permute factors in the free product. We show that a McCullough-Miller [D. McCullough and A. Miller, Symmetric Automorphisms of Free Products, Mem. Amer. Math. Soc. 122 (1996), no. 582] and Gutiérrez-Krstić [M. Gutiérrez and S. Krstić, Normal forms for the group of basis-conjug...
متن کاملGeneric automorphisms and extension lemmas
Generic automorphisms are a common theme when one works with auto-morphism groups of countable structures. They play a pivotal role in reconstruction results. In these notes we shall define and explain a notion of generic, due to John Truss, which is highly relevant to reconstruction. The idea is that a generic automorphism acts on the elements of the structure in the least special way, that is...
متن کاملComputing Conjugating Sets and Automorphism Groups of Rational Functions
Let φ and ψ be endomorphisms of the projective line of degree at least 2, defined over a field F . From a dynamical perspective, a significant question is to determine whether φ and ψ are conjugate (or to answer the related question of whether a given rational function φ has a nontrivial automorphism). We construct efficient algorithms for computing the set of conjugating maps (resp., the group...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008